Nonuniform Kolmogorov extractors
نویسنده
چکیده
We establish tight bounds on the amount on nonuniformity that is necessary for extracting a string with randomness rate 1 from a single source of randomness with lower randomness rate. More precisely, as instantiations of more general results, we show that while O(1) amount of advice regarding the source is not enough for extracting a string with randomness rate 1 from a source string with constant subunitary random rate, ω(1) amount of advice is.
منابع مشابه
Combinatorial characterizations of extractors and Kolmogorov extractors
We present characterizations of extractors and Kolmogorov extractors in terms of a combinatorial object called balanced table. These characterizations provide an alternative proof for the relation between extractors and Kolmogorov extractors, first obtained in [FHP06] and [HPV09].
متن کاملPossibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled using probability distributions and min-entropy to measure their quality and also by using individual strings and Kolmogorov complexity to measure their quality. Complexity theorists are more familiar with the first ap...
متن کاملSpace-Bounded Kolmogorov Extractors
An extractor is a function that receives some randomness and either “improves” it or produces “new” randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resourcebounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The uti...
متن کاملNearly Optimal Language Compression Using Extractors
We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: Most strings in easy sets have nearly optimal polynomial-time CD complexity. This extends work of Sipser Sip83] and Buhrman and Fortnow BF97]. We use extractors to extract the randomness of strings. In particular we show how to get from an arbitrary string, an incompressible string which enc...
متن کاملExtractors and an efficient variant of Muchnik's theorem
Muchnik's theorem about simple conditional descriprion states that for all words $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. This paper presents a new proof of this theorem, based on extractors. Employing the extractor technique, two new versions of Muchnik's theorem for space- and time-bounded Kolmogo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.6696 شماره
صفحات -
تاریخ انتشار 2012